﻿#include<iostream>
#include"BinarySearchTree.h"
using namespace std;
int main()
{
	//int a[] = { 8,3,1,10,6,4,9,14,13 };
	//BSTree<int> b;
	//BSTree<int> bb=b;
	//bb.Inorder();
	//for (auto x : a)
	//	b.InsertR(x);
	//b.Inorder();
	//for (auto x : a)
	//{
	//	//b.Erase(x);
	//	b.EraseR(x);
	//	b.Inorder();
	//}

	/*key_value::BSTree<std::string, std::string> dict;
	dict.Insert("sort", "排序");
	dict.Insert("left", "左边");
	dict.Insert("right", "右边");
	dict.Insert("insert", "插入");
	dict.Insert("key", "键值");
	
	std::string str;
	while (cin>>str)
	{
		key_value::BSTreeNode<std::string, std::string>* ret = dict.Find(str);
		if (ret)
		    cout << ret->_value << endl;
		else
			cout << "" << endl;
	}*/



	return 0;
}